A flexibly structured lot sizing heuristic for a static remanufacturing system
نویسندگان
چکیده
An effective planning of lot sizes is a key strategy to efficiently manage a combined manufacturing/ remanufacturing system in the presence of substantial setup costs. Due to its complex interdependencies, optimal policies and solutions have not been identified so far, but several heuristic approaches have been analyzed in recent contributions. The main heuristic shortcuts are forcing equally sized lot sizes over the planning horizon as well as imposing a specific cycle structure, i.e., a sequence of manufacturing batches is followed by a sequence of remanufacturing batches. We are instead proposing a flexibly structured heuristic that allows for differently sized remanufacturing batches. We show in a comprehensive numerical study that our approach outperforms other existing approaches in more than half of all instances by up to 17%. & 2013 Elsevier Ltd. All rights reserved.
منابع مشابه
OPTIMAL LOT-SIZING DECISIONS WITH INTEGRATED PURCHASING, MANUFACTURING AND ASSEMBLING FOR REMANUFACTURING SYSTEMS
This work applies fuzzy sets to the integration of purchasing, manufacturing and assembling of production planning decisions with multiple suppliers, multiple components and multiple machines in remanufacturing systems. The developed fuzzy multi-objective linear programming model (FMOLP) simultaneously minimizes total costs, total $text{CO}_2$ emissions and total lead time with reference to cus...
متن کاملA heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery
Here we discuss the lot sizing problem of product returns and remanufacturing. Let us consider a forecast of demands and product returns over a finite planning horizon — the problem is to determine an optimal production plan. This consists of either manufacturing new products or remanufacturing returned units, and in this way meets both demands at minimum costs. The costs of course are the fixe...
متن کاملThree Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing
This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...
متن کاملOn the alignment of lot sizing decisions in a remanufacturing system in the presence of random yield
In the area of reverse logistics, remanufacturing has been proven to be a valuable option for product recovery. In many industries, each step of the products’ recovery is carried out in lot sizes which leads to the assumption that for each of the different recovery steps some kind of fixed costs prevail. Furthermore, holding costs can be observed for all recovery states of the returned product....
متن کاملOn the complexity of the economic lot-sizing problem with remanufacturing options
In this paper we investigate the complexity of the economic lot-sizing problem with remanufacturing (ELSR) options. Whereas in the classical economic lot-sizing problem demand can only be satisfied by production, in the ELSR problem demand can also be satisfied by remanufacturing returned items. Although the ELSR problem can be solved efficiently for some special cases, we show that the problem...
متن کامل